A Complexity Analysis for Simple Generic Programs

The C++ Standard Template Library (STL) provides generic, high-performance algorithms and data types. STL also defines performance guarantees, but it is left as a non-trivial task to the library user to choose appropriate algorithms and data types for a particular problem. In the present paper, we describe an analysis to aid library users in selecting types for use in a generic programs. The analysis is based on manipulation and comparison of symbolic complexity expressions and serves to catch and rectify “performance bugs” by recommending type selections that will improve performance.